Level-Based Blocking for Sparse Matrices: Sparse Matrix-Power-Vector Multiplication
نویسندگان
چکیده
The multiplication of a sparse matrix with dense vector (SpMV) is key component in many numerical schemes and its performance known to be severely limited by main memory access. Several require the polynomial which typically implemented as sequence SpMVs. This results low ignores potential increase arithmetic intensity reusing data from cache. In this work we use recursive algebraic coloring engine (RACE) enable blocking across computations. graph representing form levels using breadth-first search. Locality relations these are then used improve spatial temporal locality when accessing implement an efficient multithreaded parallelization. Our approach independent structure avoids shortcomings existing “blocking” strategies terms hardware efficiency parallelization overhead. We quantify quality our implementation modelling demonstrate speedups up 3× 5× compared optimal SpMV-based baseline on single multicore chip recent Intel AMD architectures. Various like $s$ -step Krylov solvers, preconditioners power clustering algorithms will benefit development.
منابع مشابه
Decomposing Irregularly Sparse Matrices for Parallel Matrix-Vector Multiplication
In this work we show the de ciencies of the graph model for decomposing sparse matrices for parallel matrix vector multiplica tion Then we propose two hypergraph models which avoid all de cien cies of the graph model The proposed models reduce the decomposition problem to the well known hypergraph partitioning problem widely en countered in circuit partitioning in VLSI We have implemented fast ...
متن کاملSparse Matrix-Vector Multiplication for Circuit Simulation
Sparse Matrix-Vector Multiplication (SpMV) plays an important role in numerical algorithm in circuit simulation. In this report, we utilize Message Passing Interface (MPI) to parallelize the SpMV. In addition, resulting from the circuit simulation matrix formulation, the circuit systems are often represented as unstructured, not evenly-distributed sparse matrices. Therefore, we automatically de...
متن کاملAutotuning Sparse Matrix-Vector Multiplication for Multicore
Sparse matrix-vector multiplication (SpMV) is an important kernel in scientific and engineering computing. Straightforward parallel implementations of SpMV often perform poorly, and with the increasing variety of architectural features in multicore processors, it is getting more difficult to determine the sparse matrix data structure and corresponding SpMV implementation that optimize performan...
متن کاملGPU accelerated sparse matrix-vector multiplication and sparse matrix-transpose vector multiplication
Many high performance computing applications require computing both sparse matrix-vector product (SMVP) and sparse matrix-transpose vector product (SMTVP) for better overall performance. Under such a circumstance, it is critical to maintain a similarly high throughput for these two computing patterns with the underlying sparse matrix encoded in a single storage format. The compressed sparse blo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2023
ISSN: ['1045-9219', '1558-2183', '2161-9883']
DOI: https://doi.org/10.1109/tpds.2022.3223512